This paper presents two new maximum likelihood decoding (MLD) algorithms for linear codes over Z-channel, which are much more efficient than conventional exhaustive algorithms for high rate codes. In the proposed algorithms, their complexities are reduced by employing the projecting set Cs of the code, which is determined by the "projecting" structure of the code. Space and computational complexities of algorithms mainly depend upon the size of Cs which is usually several times smaller than the total number of codewords. It is shown that the upper bounds on computational complexities of decoding algorithms are in proportion to the number of parity bits and the distance between an initial estimate of the codeword and the received word, respectively, while space complexities of them are equal to the size of Cs. Lastly, numerical examples clarify the average computational complexities of the proposed algorithms, and the efficiency of these algorithms for high rate codes is confirmed.

In this paper, we propose a method to simulate the curve surface of the initial height in the movement of the electronic wire bonder using the experimental data. For given measured data (xk, yk, zk (k=1, 2, , m)), we propose an algebraic surface of n-th degree as a methematical model of the initial height surface. The AIC method is a method of evaluating the goodness of a given model. The maximum likelihood model is selected by comparing with the AIC value of each model for n=0, 1, 2, 3, , 11. Useing this model, the initial raise position of the electronic wire bonder can be controlled by computer programing and can make the movement of wire bonder full-automatic. As a resurt, the well-arranged wiring and reliable contacting can be obtained.